Fast Markov Chain Algorithms for Calculating Dempster-Shafer Belief
نویسندگان
چکیده
We present a new type of Markov Chain algo rithm for the calculation of combined Dempster Shafer belief which is almost linear in the size of the frame thus making the calculation of belief feasible for a wider range of problems We also indicate how these algorithms may be used in the cal culation of belief in product spaces associated with networks
منابع مشابه
Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief
A simple Monte-Carlo algorithm can be used to calculate Dempster-Shafer belief very efficiently unless the conflict between the evidences is very high. This paper introduces and explores Markov Chain Monte-Carlo algorithms for calculating Dempster-Shafer belief that can also work well when the conflict is high.
متن کاملA Monte-Carlo Algorithm for Dempster-Shafer Belief
A very computationally-efficient MonteCarlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster’s Rule of belief functions Bel1, . . . ,Belm then, for subset b of the frame Θ, Bel(b) can be calculated in time linear in |Θ| and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of t...
متن کاملA Sensor-Based Scheme for Activity Recognition in Smart Homes using Dempster-Shafer Theory of Evidence
This paper proposes a scheme for activity recognition in sensor based smart homes using Dempster-Shafer theory of evidence. In this work, opinion owners and their belief masses are constructed from sensors and employed in a single-layered inference architecture. The belief masses are calculated using beta probability distribution function. The frames of opinion owners are derived automatically ...
متن کاملFast-Division Architecture for Dempster-Shafer Belief Functions
Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Shafer Architecture, the Lauritzen-Spiegelhalter Architecture and the HUGIN Architecture. We propose a new architecture called ”Fast-Division Architecture” which is similar to the former two. But there are two important a...
متن کاملAn Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions
This paper analyzes the theoretical under pinnings of recent proposals for computing Dempster-Shafer Belief functions from ATMS labels. Such proposals are intended to be a means of integrating symbolic and numeric rep resentation methods and of focusing search in the ATMS. This synthesis is formalized us ing graph theory, thus showing the relation ship between graph theory, the logic-theore...
متن کامل